منابع مشابه
Quasi-concave Programming Quasi-concave Programming
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملMethod for solving quasi-concave and non-concave fuzzy multi-objective programming problems
This paper proposes a method based on linear programming techniques to treat quasi-concave and non-concave fuzzy multi-objective programming (FMOP) problems. The proposed method initially presents a piecewise linear expression to interpreting a quasi-concave membership function. Then we 7nd the convex-type break points and transform all quasiconcave membership functions into concave functions. ...
متن کاملQuasi-Concave Density Estimation
Maximum likelihood estimation of a log-concave probability density is formulated as a convex optimization problem and shown to have an equivalent dual formulation as a constrained maximum Shannon entropy problem. Closely related maximum Renyi entropy estimators that impose weaker concavity restrictions on the fitted density are also considered, notably a minimum Hellinger discrepancy estimator ...
متن کاملQuasi-concave functions on antimatroids
In this paper we consider quasi-concave set functions defined on antimatroids. There are many equivalent axiomatizations of antimatroids, that may be separated into two categories: antimatroids defined as set systems and antimatroids defined as languages. An algorthmic characterization of antimatroids, that considers them as set systems, was given in [4]. This characterization is based on the i...
متن کاملQuasi-Concave Functions and Greedy Algorithms
Many combinatorial optimization problems can be formulated as: for a given set system over E (i.e., for a pair (E, ) where ⊆ 2E is a family of feasible subsets of finite set E), and for a given function F : →R, find an element of for which the value of the function F is minimum or maximum. In general, this optimization problem is NP-hard, but for some specific functions and set systems the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Econometrica
سال: 1961
ISSN: 0012-9682
DOI: 10.2307/1911819